Autonomous Solution Methods for Large Markov Chains
نویسندگان
چکیده
One of the roadblocks to greater application of Markov chains is that non-numerically sophisticated users possess the detailed domain knowledge needed to construct a large Markov chain but may have a difficult time deciding which numerical solution method might be best suited to their applications. A realistic Markov chain model can easily contain hundreds of thousands of states, yet users may severely restrict their models to keep them small enough to fit within the constraints of certain software packages or solution methods. By making judgments about the Markov chain, an experienced researcher or practitioner can sometimes propose a solution technique in a short amount of time. This research examines methods to obtain a proposed solution technique without the services of an expert and with little or no intervention from the novice user. We take advantage of information readily available in the Markov chain to aid in the selection and execution of a solution method. This can be done without the user being an expert in the various solution techniques and their respective areas of applicability. (Markov Chains; Expert System; Linear Systems; Solution Methods)
منابع مشابه
Empirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملContinuum Limits of Markov Chains with Application to Network Modeling
In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains converges in some sense to the solution of a partial differential equation. Based on such convergence we approximate Markov chains modeling networks with a large nu...
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کاملStiffness-tolerant Methods for Transient Analysis of Stiff Markov Chains
-Three methods for numerical transient analysis of Markov chains, the modified Jensen's method (Jensen's method with steady-state detection of the underlying DTMC and computation of Poisson probabilities using the method of Fox and Glynn [1]), a third-order L-stable implicit Runge-Kutta method, and a second-order L-stable method, TR-BDF2, are compared. These methods are evaluated on the basis o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008